Towards a Physically Meaningful Definition of Computable Discontinuous and Multi-Valued Functions (Constraints)

نویسندگان

  • Martine Ceberio
  • Olga Kosheleva
  • Vladik Kreinovich
چکیده

In computable mathematics, there are known definitions of computable numbers, computable metric spaces, computable compact sets, and computable functions. A traditional definition of a computable function, however, covers only continuous functions. In many applications (e.g., in phase transitions), physical phenomena are described by discontinuous or multi-valued functions (a.k.a. constraints). In this paper, we provide a physics-motivated definition of computable discontinuous and multi-valued functions, and we analyze properties of this

منابع مشابه

Effective Borel measurability and reducibility of functions

The investigation of computational properties of discontinuous functions is an important concern in computable analysis. One method to deal with this subject is to consider effective variants of Borel measurable functions. We introduce such a notion of Borel computability for single-valued as well as for multi-valued functions by a direct effectivization of the classical definition. On Baire sp...

متن کامل

Computability of discontinuous functions Functional space approach A gerenal report at Dagstuhl Seminar

We are to discuss how to view notions of computability for discontinuous functions. We con ne ourselves to real-valued functions from some spaces. Our standpoint in studying computability problems in mathematics is doing mathematics. That is, we would like to talk about computable functions and other mathematical objects just as one talks about continuous functions, integrable functions, etc. I...

متن کامل

How Much Incomputable Is the Separable Hahn - Banach Theorem

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König’s Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multi-valued function Sep and a natural notion of reducibilit...

متن کامل

How Incomputable is the Separable Hahn-Banach Theorem?

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König’s Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multi-valued function Sep and a natural notion of reducibilit...

متن کامل

Guido Gherardi and Alberto Marcone

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak König’s Lemma within the framework of computable analysis to classify incomputable functions of low complexity. By defining the multi-valued function Sep and a natural notion of reducibilit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013